Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c‐means with tolerance
Identifieur interne : 000828 ( Main/Exploration ); précédent : 000827; suivant : 000829Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c‐means with tolerance
Auteurs : Vicenç Torra [Espagne] ; Yasunori Endo [Japon] ; Sadaaki Miyamoto [Japon]Source :
- International Journal of Intelligent Systems [ 0884-8173 ] ; 2011-04.
Abstract
Parameter selection is a well‐known problem in the fuzzy clustering community. In this paper, we propose to tackle this problem using a computationally intensive approach. We apply this approach to a new method for clustering recently introduced in the literature. It is the fuzzy c‐means with tolerance. This method permits data to include some error, and this is modeled by moving data in a particular direction within a particular range when clusters are defined. The proper application of this approach needs the correct definition of the parameter κ. A value that might be different for each record and corresponds to the maximum shift allowed to the data. In this paper, we review this method and we study the definition of this parameter κ when the same value of κ is used for all data elements. Our approach is based on the analysis of sets of data with increasing noise and an exhaustive analysis of the behavior of the algorithm with different values of κ. The analysis is motivated in privacy preserving data mining. The same approach can be used for parameter selection in other clustering algorithms. © 2010 Wiley Periodicals, Inc.
Url:
DOI: 10.1002/int.20467
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000333
- to stream Istex, to step Curation: 000333
- to stream Istex, to step Checkpoint: 000248
- to stream Main, to step Merge: 000830
- to stream Main, to step Curation: 000828
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c‐means with tolerance</title><author><name sortKey="Torra, Vicenc" sort="Torra, Vicenc" uniqKey="Torra V" first="Vicenç" last="Torra">Vicenç Torra</name></author><author><name sortKey="Endo, Yasunori" sort="Endo, Yasunori" uniqKey="Endo Y" first="Yasunori" last="Endo">Yasunori Endo</name></author><author><name sortKey="Miyamoto, Sadaaki" sort="Miyamoto, Sadaaki" uniqKey="Miyamoto S" first="Sadaaki" last="Miyamoto">Sadaaki Miyamoto</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:13FF1BBF23CC03280DEB969AB3CADDDC7808E472</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1002/int.20467</idno><idno type="url">https://api.istex.fr/document/13FF1BBF23CC03280DEB969AB3CADDDC7808E472/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000333</idno><idno type="wicri:Area/Istex/Curation">000333</idno><idno type="wicri:Area/Istex/Checkpoint">000248</idno><idno type="wicri:doubleKey">0884-8173:2011:Torra V:computationally:intensive:parameter</idno><idno type="wicri:Area/Main/Merge">000830</idno><idno type="wicri:Area/Main/Curation">000828</idno><idno type="wicri:Area/Main/Exploration">000828</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c‐means with tolerance</title><author><name sortKey="Torra, Vicenc" sort="Torra, Vicenc" uniqKey="Torra V" first="Vicenç" last="Torra">Vicenç Torra</name><affiliation wicri:level="1"><country xml:lang="fr">Espagne</country><wicri:regionArea>IIIA, Institut d'Investigaci'o en Inteligència Artificial, CSIC, Spanish Council for Scientific Research, Campus UAB, 08193 Bellaterra, Catalonia</wicri:regionArea><wicri:noRegion>Catalonia</wicri:noRegion></affiliation></author><author><name sortKey="Endo, Yasunori" sort="Endo, Yasunori" uniqKey="Endo Y" first="Yasunori" last="Endo">Yasunori Endo</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>Department of Risk Engineering, School of Systems and Information Engineering, University of Tsukuba, Ibaraki 305‐8573</wicri:regionArea><wicri:noRegion>Ibaraki 305‐8573</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author><author><name sortKey="Miyamoto, Sadaaki" sort="Miyamoto, Sadaaki" uniqKey="Miyamoto S" first="Sadaaki" last="Miyamoto">Sadaaki Miyamoto</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>Department of Risk Engineering, School of Systems and Information Engineering, University of Tsukuba, Ibaraki 305‐8573</wicri:regionArea><wicri:noRegion>Ibaraki 305‐8573</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Japon</country></affiliation></author></analytic><monogr></monogr><series><title level="j">International Journal of Intelligent Systems</title><title level="j" type="abbrev">Int. J. Intell. Syst.</title><idno type="ISSN">0884-8173</idno><idno type="eISSN">1098-111X</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2011-04">2011-04</date><biblScope unit="volume">26</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="313">313</biblScope><biblScope unit="page" to="322">322</biblScope></imprint><idno type="ISSN">0884-8173</idno></series><idno type="istex">13FF1BBF23CC03280DEB969AB3CADDDC7808E472</idno><idno type="DOI">10.1002/int.20467</idno><idno type="ArticleID">INT20467</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0884-8173</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Parameter selection is a well‐known problem in the fuzzy clustering community. In this paper, we propose to tackle this problem using a computationally intensive approach. We apply this approach to a new method for clustering recently introduced in the literature. It is the fuzzy c‐means with tolerance. This method permits data to include some error, and this is modeled by moving data in a particular direction within a particular range when clusters are defined. The proper application of this approach needs the correct definition of the parameter κ. A value that might be different for each record and corresponds to the maximum shift allowed to the data. In this paper, we review this method and we study the definition of this parameter κ when the same value of κ is used for all data elements. Our approach is based on the analysis of sets of data with increasing noise and an exhaustive analysis of the behavior of the algorithm with different values of κ. The analysis is motivated in privacy preserving data mining. The same approach can be used for parameter selection in other clustering algorithms. © 2010 Wiley Periodicals, Inc.</div></front></TEI><affiliations><list><country><li>Espagne</li><li>Japon</li></country></list><tree><country name="Espagne"><noRegion><name sortKey="Torra, Vicenc" sort="Torra, Vicenc" uniqKey="Torra V" first="Vicenç" last="Torra">Vicenç Torra</name></noRegion></country><country name="Japon"><noRegion><name sortKey="Endo, Yasunori" sort="Endo, Yasunori" uniqKey="Endo Y" first="Yasunori" last="Endo">Yasunori Endo</name></noRegion><name sortKey="Endo, Yasunori" sort="Endo, Yasunori" uniqKey="Endo Y" first="Yasunori" last="Endo">Yasunori Endo</name><name sortKey="Miyamoto, Sadaaki" sort="Miyamoto, Sadaaki" uniqKey="Miyamoto S" first="Sadaaki" last="Miyamoto">Sadaaki Miyamoto</name><name sortKey="Miyamoto, Sadaaki" sort="Miyamoto, Sadaaki" uniqKey="Miyamoto S" first="Sadaaki" last="Miyamoto">Sadaaki Miyamoto</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000828 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000828 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:13FF1BBF23CC03280DEB969AB3CADDDC7808E472
|texte= Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c‐means with tolerance
}}
| This area was generated with Dilib version V0.6.25. |  |